Asymptotically optimal idling in the GI/GI/N+GI queue
نویسندگان
چکیده
We formulate a control problem for GI/GI/N+GI queue, whose objective is to trade off the long-run average operational costs with server utilization costs. To solve problem, we consider an asymptotic regime in which arrival rate and number of servers grow large. The solution associated fluid motivates that non-idling service disciplines are not general optimal, unless some arrivals turned away. propose admission policy designed ensure have sufficient idle time, show asymptotically optimal.
منابع مشابه
Asymptotically Optimal Admission Control of a Queue with Impatient Customers
We consider a GI/GI/1 queue with impatient customers in heavy traffic. We use the solution of an approximating singular diffusion control problem to construct an admission control policy for the queue. The approximating control problem does not admit a so-called pathwise solution. Hence, the resulting admission control policy depends on second-moment data. We prove asymptotic optimality of the ...
متن کاملAn asymptotically optimal policy and state-space collapse for the multi-class shared queue
We consider a multi-class G/G/1 queue with a finite shared buffer. There is task admission and server scheduling control which aims to minimize the cost which consists of holding and rejection components. We construct a policy that is asymptotically optimal in the heavy traffic limit. The policy stems from solution to Harrison-Taksar (HT) free boundary problem and is expressed by a single free ...
متن کاملAsymptotically optimal index policies for an abandonment queue with convex holding cost
We investigate a resource allocation problem in a multi-class server with convex holding costs and user impatience under the average cost criterion. In general, the optimal policy has a complex dependency on all the input parameters and state information. Our main contribution is to derive index policies that can serve as heuristics and are shown to give good performance. Our index policy attri...
متن کاملAsymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملAsymptotically optimal Boolean functions
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2022
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2022.04.005